
public class BinaryTreeTest {

	
	
	public static void main(String[] args){

		BinarySearchTree<Integer> u = new BinarySearchTree<Integer>();
		u.insert(new TreeNode<Integer>(4));
		u.insert(new TreeNode<Integer>(2));
		u.insert(new TreeNode<Integer>(6));
		u.insert(new TreeNode<Integer>(8));
		u.insert(new TreeNode<Integer>(9));
		u.insert(new TreeNode<Integer>(7));
		u.insert(new TreeNode<Integer>(5));	
		u.insert(new TreeNode<Integer>(3));
		u.insert(new TreeNode<Integer>(1));
		System.out.println("In Order :\t"+ u.inOrder()+ " Height "+ u.height() + " Leaves " + u.leaves());
		System.out.println("Level Order :\t"+u.levelOrder()+ " Size " + u.size());
		System.out.println("Post Order :\t" + u.postOrder());
		System.out.println("Pre Order :\t" +u.preOrder());

		
		
		

	}
}
